Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Authors

  • Mani Sharifi Assistant Professor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Mehdi Yazdani Instructor, Department of industrial engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
  • Mohammad Jafar Tarokh Associate Professor, Department of Industrial Engineering, K.N. Toosi University of Technology, Tehran, Iran
  • Mohammad Navid Mokhtarian PHD Student, Department of industrial engineering, Science and research Branch, Islamic Azad University, Tehran, Iran
Abstract:

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a heterogeneous distributed computing system. To compare our algorithm with previous ones, an extensive computational study on some benchmark problems was conducted. The results obtained from the computational study indicate that the proposed algorithm is a viable and effective approach for the TAP.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

hybrid meta-heuristic algorithm for task assignment problem

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

full text

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

full text

A Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm

The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...

full text

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...

full text

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...

full text

Hybrid Heuristic Algorithm for GPS Surveying Problem

This paper introduces several approaches based on ant colony optimization for efficient scheduling the surveying activities of designing satellite surveying networks. These proposed approaches use a set of agents called ants that cooperate to iteratively construct potential observation schedules. Within the context of satellite surveying, a positioning network can be defined as a set of points ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume Volume 4  issue Issue 7

pages  45- 55

publication date 2011-01-28

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023